Reduced-size formulations for metric and cut polyhedra in sparse graphs
نویسندگان
چکیده
منابع مشابه
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfolding into R, so the metric space S is obtained from a closed (usually nonconvex) polyhedral ball in R by identifying pairs of boundary faces isometrically. Our existence proof exploits geodesic flow away from a source ...
متن کاملAn exact algorithm for MAX-CUT in sparse graphs
We study exact algorithms for the max-cut problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O∗(2(1−(2/∆))n). We also describe a max-cut algorithm for general graphs. Its time complexity is O∗(2mn/(m+n)). Both algorithms use polynomial space. Acknowledgements: The work was done whil...
متن کاملThe MAX-CUT of sparse random graphs
A k-cut of a graph G = (V,E) is a partition of its vertex set into k parts; the size of the k-cut is the number of edges with endpoints in distinct parts. MAX-k-CUT is the optimization problem of finding a k-cut of maximal size and the case where k = 2 (often called MAX-CUT) has attracted a lot of attention from the research community. MAX-CUT —more generally, MAX-k-CUT— is NP-hard and it appea...
متن کاملDuality in inhomogeneous random graphs, and the cut metric
The classical random graph model G(n, λ/n) satisfies a ‘duality principle’, in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often much easier to study the subcritical model than to directly study small components in the supercritical model...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2016
ISSN: 0028-3045
DOI: 10.1002/net.21723